AN IMPLICIT ENUMERATION ALGORITHM TO GENERATE TESTS FOR COMBINATIONAL LOGIC CIRCUITS - Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'., Twenty-Fifth International

The D-Algor i thm (DALG) i s shown t o be i n e f f e c t i v e fo r t he c l a s s o f combinat ional l o g i c c i r c u i t s t h a t i s used t o implement E r r o r Cor rec t i on and T rans la t i o n (ECAT) func t i ons . PODEM (Path-Or ien ted Dec is i on Making) i s a new t e s t genera t ion a l g o r i t h m f o r combina t iona l l o g i c c i r c u i t s . PODEM uses an i m p l i c i t enumeration approach analogous t o t h a t used f o r s o l v i n g 0 1 i n tege r programming problems. I t i s shown t h a t PODEM i s very e f f i c i e n t f o r ECAT c i r c u i t s and i s s i g n i f i c a n t l y more e f f i c i e n t than DALC over the general spectrum o f combina t iona l l o g i c c i r c u i t s . i t s s i m p l i c i t y when compared t o the D-A lgor i thm. PODEM i s a complete a l g o r i t h m i n t h a t i t w i l l generate a t e s t i f one e x i s t s . H e u r i s t i c s a r e used t o ach ieve an e f f i c i e n t i m p l i c i t search o f t h e space o f a l l poss ib le p r imary i npu t p a t t e r n s u n t i l e i t h e r a t e s t i s found o r the space i s exhausted. A d i s t i n c t i v e f e a t u r e o f PODEM i s